炮兵部队网络火力战问题研究

针对目前炮兵部队装备建设基础薄弱、炮种多、作战协调复杂的现状,依据计算机网络相关理论建立了炮兵部队网络火力战体系结构,同时运用梅卡夫定理对炮兵部队网络火力战体系的作战威力和协同能力进行了分析评估,并进行了作战运用分析。经过评估,炮兵部队网络火力战体系将大大提高炮兵部队的协同作战能力。     

Probabilistic resource pooling games

We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation.     

基于眼图的数字通信干扰效能指标构建与评估

针对数字通信干扰效能评估难度大的问题,分析眼图测量技术基本原理,提出一种基于眼图测量技术的数字通信干扰效能评估方法。从通信侦察的便捷性、直观性、有效性出发,选择部分眼图测量参数,构建通信工作效能评估指标模型。运用Matlab/Simulink构建数字通信仿真系统,检测不同信噪比条件下各指标模型随通信误码率变化的敏感程度,从中选择最佳指标用于数字通信干扰效能评估,构建干扰效能评估指标模型,简要开展干扰效能评估研究。     

基于LBP-PCA的多传感器目标识别算法

为了更加有效地提高多传感器图像融合后的识别率,提出一种基于LBP-PCA的多传感器目标识别算法。首先分别对红外和可见光图像进行预处理用以突显出要识别的目标,采用LBP算法提取目标的特征点向量,利用PCA算法进行特征融合,得到降维后的融合特征,最后利用SVM(支持向量机)进行分类和识别。实验仿真结果表明多传感器目标经过LBP-PCA融合后在保持足够数量的有效信息基础上降低了特征的维数,有效地提高了目标识别率。     

静态初始条件下的歼击机中距攻防引导方法决策

在静态初始条件下,歼击机中距攻防引导方法的选择是一个定性与定量相结合的类别划分问题,因此,将粗糙集理论与概率神经网络相结合用于该问题的解决。首先,利用粗糙集理论实现专家知识约简、空战态势信息集压缩,得到最小决策信息集;其次,利用概率神经网络进行概率决策推理;最后,通过实例分析,结果表明决策推理正确,在不确定环境下仍然有效,提高了决策过程的自动化程度。     

Layers of Experiments with Adaptive Combined Design

In the field of nanofabrication, engineers often face unique challenges in resource‐limited experimental budgets, the sensitive nature of process behavior with respect to controllable variables, and highly demanding tolerance requirements. To effectively overcome these challenges, this article proposes a methodology for a sequential design of experiments through batches of experimental runs, aptly named Layers of Experiments with Adaptive Combined Design (LoE/ACD). In higher layers, where process behavior is less understood, experimental regions cover more design space and data points are more spread out. In lower layers, experimental regions are more focused to improve understanding of process sensitivities in a local, data‐rich environment. The experimental design is a combination of a space‐filling and an optimal design with a tuning parameter that is dependent on the amount of information accumulated over the various layers. The proposed LoE/ACD method is applied to optimize a carbon dioxide (epet‐CO2) assisted deposition process for fabricating silver nanoparticles with pressure and temperature variables. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 127–142, 2015     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

用于减少远程Cache访问延迟的最后一次写访问预测方法

为减少远程Cache访问延迟,提高共享存储系统的性能,提出了一种新的基于程序内在写突发特性的最后一次写访问预测方法,并对一个具体的目录协议进行了改造,以支持该预测方法。通过预测Cache块的最后一次写访问并提前对其进行降级,处理器能直接从主存中读取数据,从而减少了远程Cache访问所需的一个网络跳步数。与当前基于指令的预测方法相比,该方法能极大减少存储开销。基准测试程序的评测结果表明,该方法能获得83.1%的预测准确率,并且能提高8.57%的程序执行性能,同时与基于指令的预测方法相比,该方法能分别减少历史踪迹表69%的存储开销和签名表36%的存储开销。     

三维疏散仿真平台研究与开发

介绍了构建三维疏散仿真平台的基本原则,从建筑模型的导入、网格的自动剖分、人员模型的构建、人员行走规则、模拟结果的显示等方面对疏散仿真平台进行了阐述,测试了疏散仿真平台的功能,得出模拟结果与疏散演习结果接近的结论,认为该疏散仿真平台具有广泛的应用前景。     

高技术装备维修知识共享

将知识管理的思想引入到装备维修中,认为装备维修组织与高技术装备生产厂家之间的知识共享是提升高技术装备维修能力的重要因素。通过建立知识共享模型,对装备维修组织与高技术装备生产厂家知识共享过程进行了分析,得出知识总量螺旋上升的结果。在此基础上进行博弈分析,运用数学方法,找出主导高技术装备维修知识共享活动的关键因素,并结合实际,研究应对方法,推动装备维修知识共享,促进装备维修组织知识创新,从而提高装备维修能力。